

int main(){
    int n;
    int A[10][10] = {};
    int path[10][10] = {};
    for (int k = 0; k < n; k++){
        for(int i=0; i<n; i++){
            for(int j=0; j<n; j++){
                if(A[i][j]>A[i][k]+A[k][j]){
                    A[i][j] = A[i][k]+A[k][j];
                    path[i][j]=k;
                }
            }
        }
    }
    return 0;
}


